Completeness Theorems, Representation Theorems: What is the Difference
نویسنده
چکیده
Most areas of logic can be approached either semantically or syntactically. Typically, the approaches are linked through a completeness or representation theorem. The two kinds of theorem serve a similar purpose, yet there also seems to be some residual distinction between them. In what respects do they differ, and how important are the differences? Can we have one without the other? We discuss these questions, with examples from a variety of different logical systems.
منابع مشابه
Completeness Theorems , Representation Theorems : What ’ s the Difference ?
Most areas of logic can be approached either semantically or syntactically. Typically, the approaches are linked through a completeness or representation theorem. The two kinds of theorem serve a similar purpose, yet there also seems to be some residual distinction between them. In what respects do they differ, and how important are the differences? Can we have one without the other? We discuss...
متن کاملrepresentation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملSuzuki-type fixed point theorems for generalized contractive mappings that characterize metric completeness
Inspired by the work of Suzuki in [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861--1869], we prove a fixed point theorem for contractive mappings that generalizes a theorem of Geraghty in [M.A. Geraghty, On contractive mappings, Proc. Amer. Math. Soc., 40 (1973), 604--608]an...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملThe Quantum Completeness Problem
Quantum mechanics (QM) is complete in a precise sense. It cannot be supplemented by more informative descriptions of physical systems given certain reasonable assumptions; this is what the no-hidden-variables proofs show. Theorems of Kochen-Specker-type (KS theorems) crucially employ an assumption of context-independence of the observables considered while those of Bell-type theorems use an ass...
متن کامل